Scheduling starting times for an active redundant system with non-identical lifetimes
نویسندگان
چکیده
Here we examine an active redundant system with scheduled starting times of the units. We assume availability of n non-identical, non-repairable units for replacement or support. The original unit starts its operation at time s1 = 0 and each one of the (n 1) standbys starts its operation at scheduled time si (i = 2, . . .,n) and works in parallel with those already introduced and not failed before si. The system is up at times si (i = 2, . . .,n), if and only if, there is at least one unit in operation. Thus, the system has the possibility to work with up to n units, in parallel structure. Unit-lifetimes Ti (i = 1, . . .,n) are independent with cdf Fi, respectively. The system has to operate without inspection for a fixed period of time c and it stops functioning when all available units fail before c. The probability that the system is functioning for the required period of time c depends on the distribution of the unit-lifetimes and on the scheduling of the starting times si. The reliability of the system is evaluated via a recursive relation as a function of the starting times si (i = 2, . . .,n). Maximizing with respect to the starting times we get the optimal ones. Analytical results are presented for some special distributions and moderate values of n. 2005 Elsevier Inc. All rights reserved.
منابع مشابه
A New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملDesign of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System
This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...
متن کاملFuzzy Reliability Optimization Models for Redundant Systems
In this paper, a special class of redundancy optimization problem with fuzzy random variables is presented. In this model, fuzzy random lifetimes are considered as basic parameters and the Er-expected of system lifetime is used as a major type of system performance. Then a redundancy optimization problem is formulated as a binary integer programming model. Furthermore, illustrative numerical ex...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کامل